Large representation recurrences in large N random unitary matrix models
نویسندگان
چکیده
منابع مشابه
The large-N expansion of unitary-matrix models
The general features of the 1/N expansion in statistical mechanics and quantum field theory are briefly reviewed both from the theoretical and from the phenomenological point of view as an introduction to a more detailed analysis of the large-N properties of spin and gauge models possessing the symmetry group SU(N )× SU(N ). An extensive discussion of the known properties of the single-link int...
متن کاملLarge N Renormalization Group for Random Matrix Models
We report on our recent studies of the large N renormalization group (RG) method which clariies phase structure of random matrix models. We derive an exact RG equation which enables us to obtain the exact locations of xed points and their scaling exponents. The classiication of phases is given by this analysis. A linear approximation visualizes the RG ow of crossover phenomena including several...
متن کاملA ug 1 99 6 The large - N expansion of unitary - matrix models
The general features of the 1/N expansion in statistical mechanics and quantum field theory are briefly reviewed both from the theoretical and from the phenomenological point of view as an introduction to a more detailed analysis of the large-N properties of spin and gauge models possessing the symmetry group SU(N)× SU(N). An extensive discussion of the known properties of the single-link integ...
متن کاملR - charged AdS 5 black holes and large N unitary matrix models
Using the AdS/CFT, we establish a correspondence between the intricate thermal phases of R-charged AdS5 blackholes and the R-charge sector of the N=4 gauge theory, in the large N limit. Integrating out all fields in the gauge theory except the thermal Polyakov line, leads to an effective unitary matrix model. In the canonical ensemble, a logarithmic term is generated in the non-zero charge sect...
متن کاملLaws of Large Numbers for Random Linear
The computational solution of large scale linear programming problems contains various difficulties. One of the difficulties is to ensure numerical stability. There is another difficulty of a different nature, namely the original data, contains errors as well. In this paper, we show that the effect of the random errors in the original data has a diminishing tendency for the optimal value as the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of High Energy Physics
سال: 2011
ISSN: 1029-8479
DOI: 10.1007/jhep10(2011)066